A Community-Based Approach to Identifying Influential Spreaders
نویسندگان
چکیده
Identifying influential spreaders in complex networks has a significant impact on understanding and control of spreading process in networks. In this paper, we introduce a new centrality index to identify influential spreaders in a network based on the community structure of the network. The community-based centrality (CbC) considers both the number and sizes of communities that are directly linked by a node. We discuss correlations between CbC and other classical centrality indices. Based on simulations of the single source of infection with the Susceptible-Infected-Recovered (SIR) model, we find that CbC can help to identify some critical influential nodes that other indices cannot find. We also investigate the stability of CbC.
منابع مشابه
Identifying Influential Spreaders of Epidemics on Community Networks
An efficient strategy for the identification of influential spreaders that could be used to control epidemics within populations would be of cons iderable importance. Generally, populations are characterized by its commun ity structures and by the heterogeneous distributions of weak ties among nodes bridging over communit ies. A strategy for commun ity networks capable of identifying influentia...
متن کاملFinding influential spreaders from human activity beyond network location
Most centralities proposed for identifying influential spreaders on social networks to either spread a message or to stop an epidemic require the full topological information of the network on which spreading occurs. In practice, however, collecting all connections between agents in social networks can be hardly achieved. As a result, such metrics could be difficult to apply to real social netw...
متن کاملCorrigendum: Identifying a set of influential spreaders in complex networks
Identifying a set of influential spreaders in complex networks plays a crucial role in effective information spreading. A simple strategy is to choose top-r ranked nodes as spreaders according to influence ranking method such as PageRank, ClusterRank and k-shell decomposition. Besides, some heuristic methods such as hill-climbing, SPIN, degree discount and independent set based are also propose...
متن کاملRanking influential spreaders is an ill-defined problem
Finding influential spreaders of information and disease in networks is an important theoretical problem, and one of considerable recent interest. It has been almost exclusively formulated as a node-ranking problem— methods for identifying influential spreaders rank nodes according to how influential they are. In this work, we show that the ranking approach does not necessarily work: the set of...
متن کاملCore-like groups result in invalidation of identifying super-spreader by k-shell decomposition
Identifying the most influential spreaders is an important issue in understanding and controlling spreading processes on complex networks. Recent studies showed that nodes located in the core of a network as identified by the k-shell decomposition are the most influential spreaders. However, through a great deal of numerical simulations, we observe that not in all real networks do nodes in high...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Entropy
دوره 17 شماره
صفحات -
تاریخ انتشار 2015